989A - A Blend of Springtime - CodeForces Solution

implementation strings *900

Please click on ads to support us..

Python Code: 

import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

s = list(input().rstrip())
ans = "No"
for i in range(len(s) - 2):
    u = set()
    for j in range(3):
        if s[i + j] ^ 46:
            u.add(s[i + j])
    if len(u) == 3:
        ans = "Yes"
        break
print(ans)

C++ Code: 

#include<bits/stdc++.h>
using namespace std;

#define int long long int

signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin>>s;
int c=0;
for(int i=1;i<s.length()-1;i++){
    if((s[i]=='A'&&s[i+1]=='C'&&s[i-1]=='B') ||(s[i]=='A'&&s[i+1]=='B'&&s[i-1]=='C')  ||(s[i]=='B'&&s[i+1]=='C'&&s[i-1]=='A') ||(s[i]=='B'&&s[i+1]=='A'&&s[i-1]=='C')||(s[i]=='C'&&s[i+1]=='A'&&s[i-1]=='B')||(s[i]=='C'&&s[i+1]=='B'&&s[i-1]=='A')    ){
    c=1;
    break;
   
    }

}
if(c==0)cout<<"No";
else if(c==1)cout<<"Yes";
}


Comments

Submit
0 Comments
More Questions

706B - Interesting drink
1265A - Beautiful String
214A - System of Equations
287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways
1663F - In Every Generation
1108B - Divisors of Two Integers
1175A - From Hero to Zero
1141A - Game 23
1401B - Ternary Sequence
598A - Tricky Sum
519A - A and B and Chess
725B - Food on the Plane
154B - Colliders
127B - Canvas Frames
107B - Basketball Team
245A - System Administrator
698A - Vacations
1216B - Shooting
368B - Sereja and Suffixes
1665C - Tree Infection
1665D - GCD Guess
29A - Spit Problem
1097B - Petr and a Combination Lock
92A - Chips
1665B - Array Cloning Technique
1665A - GCD vs LCM